Convergence of the steepest descent method for accretive operators
نویسندگان
چکیده
منابع مشابه
On the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملA Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
Preconditioned gradient iterations for very large eigenvalue problems are efficient solvers with growing popularity. However, only for the simplest preconditioned eigensolver, namely the preconditioned gradient iteration (or preconditioned inverse iteration) with fixed step size, sharp non-asymptotic convergence estimates are known. These estimates require a properly scaled preconditioner. In t...
متن کاملAsymptotic Convergence of the Steepest Descent Method for the Exponential Penalty in Linear Programming
u̇(t) = −∇xf(u(t), r(t)), u(t0) = u0 where f(x, r) is the exponential penalty function associated with the linear program min{c′x : Ax ≤ b}, and r(t) decreases to 0 as t goes to ∞. We show that for each initial condition (t0, u0) the solution u(t) is defined on the whole interval [t0,∞) and, under suitable hypothesis on the rate of decrease of r(t), we establish the convergence of u(t) towards a...
متن کاملRobust convergence of the steepest descent method for data-based control
Iterative data-based controller tuning consists of iterative adjustment of the controller parameters towards the parameter values which minimize an H2 performance criterion. The convergence to the global minimum of the performance criterion depends on the initial controller parameters and on the step size of each iteration. This paper presents convergence properties of iterative algorithms when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1999
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-99-04975-8